The Tower of Hanoi Problem with Evildoer Discs
نویسندگان
چکیده
منابع مشابه
Combinatorics of topmost discs of multi-peg Tower of Hanoi problem
Combinatorial properties of the multi-peg Tower of Hanoi problem on n discs and p pegs are studied. Top-maps are introduced as maps which reflect topmost discs of regular states. We study these maps from several points of view. We also count the number of edges in graphs of the multi-peg Tower of Hanoi problem and in this way obtain some combinatorial identities.
متن کاملThe Tower of Hanoi problem on Pathh graphs
The generalized Tower of Hanoi problem with h ≥ 4 pegs is known to require a sub-exponentially fast growing number of moves in order to transfer a pile of n disks from one peg to another. In this paper we study the Pathh variant, where the pegs are placed along a line, and disks can be moved from a peg to its nearest neighbor(s) only. Whereas in the simple variant there are h(h−1)/2 possible bi...
متن کاملOn Optimal Solutions for the Bottleneck Tower of Hanoi Problem
We study two aspects of a generalization of the Tower of Hanoi puzzle. In 1981, D. Wood suggested its variant, where a bigger disk may be placed higher than a smaller one if their size difference is less than k. In 1992, D. Poole suggested a natural disk-moving strategy for this problem, but only in 2005, the authors proved it be optimal in the general case. We describe the family of all optima...
متن کاملA Representation Approach to the Tower of Hanoi Problem
By making the moving direction of each disc explicit in the representation, a bit-string so constructed can be used to drive the Tower of Hanoi algorithm. The behaviour of disc moves is further analyzed based on the bit-string representation. It has been shown that the bit-string for moving n discs can be used to generate successively the Gray codes of n bits.
متن کاملOn a question of Leiss regarding the Hanoi Tower problem
The Tower of Hanoi problem is generalized in such a way that the pegs are located at the vertices of a directed graph G, and moves of disks may be made only along edges of G. Leiss obtained a complete characterization of graphs in which arbitrarily many disks can be moved from the source vertex S to the destination vertex D. Here we consider graphs which do not satisfy this characterization; he...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Bangladesh Academy of Sciences
سال: 2020
ISSN: 0378-8121
DOI: 10.3329/jbas.v43i2.45742